Search results for "Directed rural postman problem"

showing 3 items of 3 documents

The stacker crane problem and the directed general routing problem

2015

[EN] This article deals with the polyhedral description and the resolution of the directed general routing problem (DGRP) and the stacker crane problem (SCP). The DGRP contains a large number of important arc and node routing problems as special cases, including the SCP. Large families of facet-defining inequalities for the DGRP are described and a branch-and-cut algorithm for these problems is presented. Extensive computational experiments over different sets of DGRP and SCP instances are included.

Mathematical optimizationDirected general routing problemStacker crane problemComputer Networks and CommunicationsStackerNode (networking)Branch-and-cut algorithmDirected graphResolution (logic)Directed rural postman problemHardware and ArchitectureRouting (electronic design automation)MATEMATICA APLICADASoftwareInformation SystemsMathematics
researchProduct

An ILS-Based Metaheuristic for the Stacker Crane Problem

2012

[EN] In this paper we propose a metaheuristic algorithm for the Stacker Crane Problem. This is an NP-hard arc routing problem whose name derives from the practical problem of operating a crane. Here we present a formulation and a lower bound for this problem and propose a metaheuristic algorithm based on the combination of a Multi-start and an Iterated Local Search procedures. Computational results on a large set of instances are presented.

Mathematical optimizationIterated local searchComputer scienceStackerComputerApplications_COMPUTERSINOTHERSYSTEMSMetaheuristicsUpper and lower boundsParallel metaheuristicDirected rural postman problemCombinatorial OptimizationCombinatorial optimizationLarge set (combinatorics)MATEMATICA APLICADAMetaheuristicArc routingAlgorithm
researchProduct

Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem

2017

[EN] The generalized directed rural postman problem is an arc routing problem with many interesting real-life applications, such as routing for meter reading. In this application, a vehicle with a receiver travels through a series of neighborhoods. If the vehicle gets closer than a certain distance to a meter, the receiver is able to record the gas, water, or electricity consumption. Therefore, the vehicle does not need to traverse every street, but only a few, to get close enough to each meter. We study an extension of this problem in which a fleet of vehicles is available. Given the characteristics of the mentioned application, the vehicles have no capacities but there is a maximum distan…

90C27Mathematical optimizationControl and OptimizationTraverseManagement Science and Operations ResearchMathematicsT57-57.97Applied mathematics. Quantitative methodsSeries (mathematics)Extension (predicate logic)90C1090B99QA75.5-76.9590C57Constraint (information theory)Computational MathematicsClose-enough arc routing problemBranch-and-cutModeling and SimulationElectronic computers. Computer scienceRouting (electronic design automation)Distance constrainedMATEMATICA APLICADABranch and cutArc routingAlgorithmAutomatic meter readingMultivehicleGeneralized directed rural postman problem
researchProduct